Sublinear deviation between geodesics and sample paths
نویسندگان
چکیده
منابع مشابه
Sublinear deviation between geodesics and sample paths
We give a proof of the sublinear tracking property for sample paths of random walks on various groups acting on spaces with hyperbolic-like properties. As an application, we prove sublinear tracking in Teichmüller distance for random walks on mapping class groups, and on Cayley graphs of a large class of finitely generated groups.
متن کاملDeviation of geodesics in FLRW spacetime geometries
The geodesic deviation equation (‘GDE’) provides an elegant tool to investigate the timelike, null and spacelike structure of spacetime geometries. Here we employ the GDE to review these structures within the Friedmann–Lemâıtre–Robertson–Walker (‘FLRW’) models, where we assume the sources to be given by a non-interacting mixture of incoherent matter and radiation, and we also take a non-zero co...
متن کاملSample Paths in Wavelet Theory
We consider a class of convergence questions for infinite products that arise in wavelet theory when the wavelet filters are more singular than is traditionally built into the assumptions. We establish pointwise convergence properties for the absolute square of the scaling functions. Our proofs are based on probabilistic tools.
متن کاملEstimating the unseen: A sublinear-sample canonical estimator of distributions
We introduce a new approach to characterizing the unobserved portion of a distribution, whichprovides sublinear-sample additive estimators for a class of properties that includes entropy anddistribution support size. Together with the lower bounds proven in the companion paper [29],this settles the longstanding question of the sample complexities of these estimation problems (up...
متن کاملShortest paths between shortest paths
We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Duke Mathematical Journal
سال: 2015
ISSN: 0012-7094
DOI: 10.1215/00127094-2871197